Pre-adjunctions and lambda-algebraic theories
نویسندگان
چکیده
منابع مشابه
Algebraic Theories for Contextual Pre-nets
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors that must be somewhat filtered out. In this paper, we exploit partial membership equational logic to define a suitable theory of models, where the meaningful concurrent computations can be selected by means of m...
متن کاملLambda Theories of Effective Lambda Models
A longstanding open problem is whether there exists a nonsyntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ. In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which covers...
متن کاملLambda Calculus: Models and Theories
In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λ-theories, the equational incompleteness of lambda calculus semantics, and the λ-theories induced by graph models of lambda calculus.
متن کاملThe algebraic lambda calculus
We introduce an extension of the pure lambda-calculus by endowing the set of terms with a structure of vector space, or more generally of module, over a xed set of scalars. Terms are moreover subject to identities similar to usual pointwise de nition of linear combinations of functions with values in a vector space. We then study a natural extension of beta-reduction in this setting: we prove i...
متن کاملIntersection Types and Lambda Theories
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of λ-theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be described in an uniform way by a predicate. This allows us to prove the consistency of a well-know λ-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1984
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-48-2-153-165